Matrix Analysis and Algorithms
نویسندگان
چکیده
Introduction The three basic problems we will address in this book are as follows. In all cases we are given as data a matrix A ∈ C m×n , with m ≥ n and, for the rst two problems, the vector b ∈ C m. (SLE) denotes simultaneous linear equations, (LSQ) denotes least squares and (EVP) denotes eigenvalue problem.
منابع مشابه
On the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملالگوریتم مستطیل آبشاری و ماتریس انتقال در شبکه های کوتاه ترین مسیر بادور
Shortest path problem is among the most interesting problems in the field of graph and network theory. There are many efficient matrix based algorithms for detecting of shortest path and distance between all pairs of this problem in literature. In this paper, a new exact algorithm, named Cascade Rectangle Algorithm, is presented by using main structure of previous exact algorithms and developin...
متن کاملA Direct Matrix Inversion-Less Analysis for Distribution System Power Flow Considering Distributed Generation
This paper presents a new direct matrix inversion-less analysis for radial distribution systems (RDSs). The method can successfully deal with weakly meshed distribution systems. (WMDSs). Being easy to implement, direct methods (DMs) provide an excellent performance. Matrix inversion is the mean reason of divergence and low-efficiency in power flow algorithms. In this paper, the performance of t...
متن کاملVibration Analysis of Global Near-regular Mechanical Systems
Some near-regular mechanical systems involve global deviations from their corresponding regular system. Despite extensive research on vibration analysis (eigensolution) of regular and local near-regular mechanical systems, the literature on vibration analysis of global near-regular mechanical systems is scant. In this paper, a method for vibration analysis of such systems was developed using Kr...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کامل